On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity

We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamples is developed that demonstrates that the algorithm goes through exponentially many steps.Comment: In Proceedings UNIF 2010, arXiv:1012.455

Enhanced UV Light emission from Silicon nanoparticles induced by Au ion implantation

Study of light emitting silicon fabricated by ion implantation.Comment: G-COE Conference - Kyoto 2008 abstrac